S-MEP: A Planner for Numeric Goals
نویسندگان
چکیده
Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems containing numeric goal expressions. We report on planner S-MEP (Sequential More Expressive Planner) in this paper. S-MEP handles non-linear as well as linear expressions in preconditions, effects and goal. Metric-FF handles only linear expressions. Metric-FF ignores decrease effects of actions while computing the heuristic information. S-MEP considers decrease effects of actions while computing heuristic information. We report on empirical evaluation of S-MEP and its comparison with two versions of Metric-FF on 400 problems from linear Jugs domain, 120 problems from linear Short-Move-Karel domain and 120 problems from linear Long-Move-Karel domain. Karel domains are robotic transportation domains and Jugs domain is a fluid transfer domain. S-MEP solves many problems that neither version of Metric-FF can solve.
منابع مشابه
Boosting Search Guidance in Problems with Semantic Attachments
Most applications of planning to real problems involve complex and often non-linear equations, including matrix operations. PDDL is ill-suited to express such calculations since it only allows basic operations between numeric fluents. To remedy this restriction, a generic PDDL planner can be connected to a specialised advisor, which equips the planner with the ability to carry out sophisticated...
متن کاملOver-Subscription Planning with Numeric Goals
By relaxing the hard-goal constraints from classical planning and associating them with reward values, over-subscription planning allows users to concentrate on presenting what they want and leaves the task of deciding the best goals to achieve to the planner. In this paper, we extend the over-subscription planning problem and its limited goal specification to allow numeric goals with continuou...
متن کاملLPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PDDL3 preferences. Our focus is on computation of relaxed plan based heuristics that effectively guide a planner towards good solutions satisfying preferences. We build on the planner LPRPG, a hybrid relaxed planning graph (RPG)–linear programming (LP) approach. We make extensions to the RPG to rea...
متن کاملSet-Additive and TSP Heuristics for Planning with Action Costs and Soft Goals
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP planner and the relaxed plan heuristic used in FF. The set-additive heuristic is defined mathematically and handles non-uniform action costs like the additive heuristic but like FF’s heuristic, it encodes the cost of a sp...
متن کاملProbability Density for Number of Customers Served During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue or Probability Density for Services During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where both the arrivals and service processes can be serially auto-correlated Matrix Exponential Processes and provide a mechanism to compute the expected number of customers served during a finite queue’s busy period. We then show some numeric results by computing the probabilities of serving exactly n c...
متن کامل